TR
11111

COURSE INTRODUCTION AND APPLICATION INFORMATION

ce.cs.ieu.edu.tr

Course Name
Code
Semester
Theory
(hour/week)
Application/Lab
(hour/week)
Local Credits
ECTS
Fall/Spring
Prerequisites
None
Course Language
Course Type
Elective
Course Level
-
Mode of Delivery -
Teaching Methods and Techniques of the Course Problem Solving
Course Coordinator -
Course Lecturer(s) -
Assistant(s) -
Course Objectives
Learning Outcomes The students who succeeded in this course;
  • Learn how to isolate the underlying structure of the problem to tackle it.
  • Analyze the time and space complexity of algorithms.
  • Have an increased number of solutions in their portfolio of algorithms to tackle an even more diverse set of problems.
  • Efficiently solve problems with greedy algorithms that can be modeled directly or through a sequence of transformations as instances of interval scheduling, interval partitioning, scheduling to minimize lateness, clustering, and minimum-cost arborescence problems.
  • Understand whether a problem can be solved with the help of a divide-and-conquer algorithm and efficiently solve problems that can be modeled directly or through a sequence of transformations as instances of inversion counting, closest pair of points and integer multiplication and use fast Fourier transformation for developing efficient algorithms.
  • Learn how to model dynamic programming solutions for weighted interval scheduling, segmented least squares and sequence alignment problems and capitalize upon this to generalize it.
  • Assess the trade-off between time and optimality and use approximation algorithms when the optimal is not feasible and distinguish those problems to which load balancing and set cover can be reduced They will use the approximation bounds obtained for load balancing and set cover for similar intractable problems where possible.
Course Description

 



Course Category

 Core Courses
Major Area Courses
X
Supportive Courses
Media and Managment Skills Courses
Transferable Skill Courses

 

WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES

Week Subjects Required Materials
1 Introduction and motivation. Mathematical foundations, summation, recurrences and growth of functions Cormen Chapter 2, 3, and 4
2 Asymptotic notation and Master theorem Cormen Chapter 4
3 Binary heaps and analysis of heapsort Cormen Chapter 6
4 Sorting theory and more comparison sorting algorithms: Analysis of merge sort andQuicksort. Cormen Chapter 7
5 Worst case analysis of Quicksort Cormen Chapter 7
6 Sorting in linear time, lower bounds for sorting, counting sort, radix sort, bucket sort Cormen Chapter 8
7 Medians and order statistics. Finding median and rank in linear time, selectionalgorithm. Cormen Chapter 9
8 Midterm
9 Elementary data structures and runtime analysis of insertion, deletion and update Cormen Chapter 10
10 Hash tables and runtime analysis. Cormen Chapter 11
11 Binary search trees and Redblack trees Cormen Chapter 12 and 13
12 Btrees and Augmenting data structures Cormen Chapter 18
13 Amortized analysis Cormen Chapter 17
14 Binomial heaps and fibonacci heaps Cormen Chapter 19 and 20
15 Review
16 Review of the Semester  
Course Notes/Textbooks Introduction to Algorithms, 2/eThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ISBN: 9780262533058, MIT PressData Structures and Algorithm Analysis in C++, Mark Allen Weiss, Addision Wesley, Third Edition.
Suggested Readings/Materials Algorithm Design. Jon Kleinberg and Eva Tardos. 2006, Pearson Education, ISBN 0321372913

 

EVALUATION SYSTEM

Semester Activities Number Weigthing
Participation
Laboratory / Application
Field Work
Quizzes / Studio Critiques
Portfolio
Homework / Assignments
Presentation / Jury
Project
6
30
Seminar / Workshop
Oral Exam
Midterm
1
30
Final Exam
1
40
Total

Weighting of Semester Activities on the Final Grade
60
Weighting of End-of-Semester Activities on the Final Grade
40
Total

ECTS / WORKLOAD TABLE

Semester Activities Number Duration (Hours) Workload
Course Hours
(Including exam week: 16 x total hours)
16
3
48
Laboratory / Application Hours
(Including exam week: 16 x total hours)
16
Study Hours Out of Class
15
2
Field Work
Quizzes / Studio Critiques
Portfolio
Homework / Assignments
Presentation / Jury
Project
6
2
Seminar / Workshop
Oral Exam
Midterms
1
10
Final Exams
1
20
    Total
120

 

COURSE LEARNING OUTCOMES AND PROGRAM QUALIFICATIONS RELATIONSHIP

#
 Program Competencies/Outcomes
* Contribution Level
1
2
3
4
5
1

Adequate knowledge in Mathematics, Science and Computer Engineering; ability to use theoretical and applied information in these areas to model and solve Computer Engineering problems

 X
2

Ability to identify, define, formulate, and solve complex Computer Engineering problems; ability to select and apply proper analysis and modeling methods for this purpose

 X
3

Ability to design a complex computer based system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose

 X
4

Ability to devise, select, and use modern techniques and tools needed for Computer Engineering practice

 X
5

Ability to design and conduct experiments, gather data, analyze and interpret results for investigating Computer Engineering problems

 X
6

Ability to work efficiently in Computer Engineering disciplinary and multi-disciplinary teams; ability to work individually
7

Ability to communicate effectively in Turkish, both orally and in writing; knowledge of a minimum of two foreign languages
8

Recognition of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself
9

Awareness of professional and ethical responsibility
10

Information about business life practices such as project management, risk management, and change management; awareness of entrepreneurship, innovation, and sustainable development

 X
11

Knowledge about contemporary issues and the global and societal effects of engineering practices on health, environment, and safety; awareness of the legal consequences of Computer Engineering solutions

 X

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest

 

İzmir Ekonomi Üniversitesi | Sakarya Caddesi No:156, 35330 Balçova - İZMİR Tel: +90 232 279 25 25 | webmaster@ieu.edu.tr | YBS 2010